Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators
نویسندگان
چکیده
منابع مشابه
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators
Despite recent progress in AI planning, many benchmarks remain challenging for current planners. In many domains, the performance of a planner can greatly be improved by discovering and exploiting information about the domain structure that is not explicitly encoded in the initial PDDL formulation. In this paper we present and compare two automated methods that learn relevant information from p...
متن کاملMacro - FF
This document describes Macro-FF, an adaptive planning system developed on top of FF version 2.3. The original FF is a fully automatic planner that uses a heuristic search approach. In addition, Macro-FF can automatically learn and use macro-actions with the goal of reducing the number of expanded nodes in the search. Macro-FF also includes implementation enhancements for reducing space and CPU...
متن کاملSearching for Macro Operators with Automatically Generated Heuristics
Macro search is used to derive solutions quickly for large search spaces at the expense of optimality. We present a novel way of building macro tables. Our contribution is twofold: (1) for the first time, we use automatically generated heuristics to find optimal macros, (2) due to the speed-up achieved by (1), we merge consecutive subgoals to reduce the solution lengths. We use the Rubik’s Cube...
متن کاملGenerating Macro Operators for Decision-Theoretic Planning
ion in probabilistic domains has long been rec-ognizedas an effective tool to faciliate faster reasoning.In this paper we focused on the technical side of ob-taining a correct macro abstraction; a comprehensivetheory of abstracting probabilistic actions is presentedin [2]. Empirical results of applying the technique toseveral domains showed substantial reduction in t...
متن کاملOptimal SAT-based Planning with Macro-actions and Learned Horizons
Planning as propositional satisfiability (SAT) is a powerful approach for computing optimal plans in terms of Graphplan plan length. SatPlan (Kautz and Selman 1992) is one of the most popular and efficient planning system adopting this approach. First, it computes a lower bound k of the optimal plan length. Then, using k as the planning horizon, i.e., a fixed time step after which actions canno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2005
ISSN: 1076-9757
DOI: 10.1613/jair.1696